Operator algebras for higher rank analysis and their application to factorial languages
نویسندگان
چکیده
We study strong compactly aligned product systems of ℤ + over a C*-algebra A. provide description their Cuntz-Nica-Pimsner algebra in terms tractable relations coming from ideals This approach encompasses where the left action is given by compacts, as well wide class higher rank graphs (beyond row-finite). Moreover we analyze factorial languages and C*-algebras. Many one results literature find here analogues. In particular, show that sofic language coincides with Cuntz-Krieger its unlabeled follower set graph. However, there are also differences. For example, can lie in-between first quantization quotient supported operators.
منابع مشابه
Lie-type higher derivations on operator algebras
Motivated by the intensive and powerful works concerning additive mappings of operator algebras, we mainly study Lie-type higher derivations on operator algebras in the current work. It is shown that every Lie (triple-)higher derivation on some classical operator algebras is of standard form. The definition of Lie $n$-higher derivations on operator algebras and related pot...
متن کاملHigher Rank Graph Algebras
These are lecture notes of a course given by Alex Kumjian at the RMMC Summer School at the University of Wyoming, Laramie, June 1-5, 2015. Warning: little proofreading has been done.
متن کاملLecture Notes on Higher-rank Graphs and Their C∗-algebras
These are notes for a short lecture course on k-graph C∗-algebras to be delivered at the Summer School on C∗-algebras and their interplay with dynamics at the Sophus Lie Conference Centre in Nordfjordeid, Norway in June 2010. They are not even remotely comprehensive of the work that many authors have done on k-graphs, nor are all details even of the material covered included. In addition, there...
متن کاملHigher-order Operator Precedence Languages
Floyd’s Operator Precedence (OP) languages are a deterministic context-free family having many desirable properties. They are locally and parallely parsable, and languages having a compatible structure are closed under Boolean operations, concatenation and star; they properly include the family of Visibly Pushdown (or Input Driven) languages. OP languages are based on three relations between an...
متن کاملHigher Rank Graph C∗-algebras
Building on recent work of Robertson and Steger, we associate a C∗–algebra to a combinatorial object which may be thought of as a higher rank graph. This C∗–algebra is shown to be isomorphic to that of the associated path groupoid. Various results in this paper give sufficient conditions on the higher rank graph for the associated C∗–algebra to be: simple, purely infinite and AF. Results concer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal D Analyse Mathematique
سال: 2021
ISSN: ['0021-7670', '1565-8538']
DOI: https://doi.org/10.1007/s11854-021-0163-6